Elon Lindenstrauss Citation: “For his results on measure rigidity in ergodic theory, and their applications to number theory.” Elon Lindenstrauss has developed extraordinarily powerful theoretical tools in ergodic th

Source URL: www.icm2010.in

• Ergodic theory
• Dynamical systems
• Stochastic processes
• Diophantine approximation
• Anatole Katok
• Elon Lindenstrauss
• Littlewood conjecture
• Ergodicity
• Ergodic
• Chaos theory
• Invariant measure
• Manfred Einsiedler

Constructive Discrepancy Minimization for Convex Sets Thomas Rothvoss UW Seattle Discrepancy theory

Source URL: www.math.washington.edu

• Diophantine approximation
• Graph coloring
• Combinatorics
• Discrepancy theory
• Measure theory

Nearest lattice problem, diophantine approximation April 12, L´ aszl´ o Babai. On Lov´

Source URL: people.cs.uchicago.edu

• Lattice-based cryptography
• Lattice problem
• Lattice
• Sanjeev Arora

LINEAR RECURRENCES AND THE SUBSPACE THEOREM FEDERICO ZERBINI I will divide my talk into 2 parts. First of all I will talk about Diophantine approximation, which is the branch of mathematics studying the approximation of

Source URL: www.math.uni-bonn.de

Effective equidistribution of eigenvalues of Hecke operators

Source URL: www.iiserpune.ac.in

• Diophantine approximation
• Ergodic theory
• Equidistributed sequence
• Equidistribution theorem
• Hecke operator
• Spectral theory
• Spectral theory of ordinary differential equations

On Cornacchia’s algorithm for solving the diophantine equation u2 + dv 2 = m F. Morain ∗† J.-L. Nicolas ‡ September 12, 1990

Source URL: www.lix.polytechnique.fr

• QN
• Euclidean algorithm
• Diophantine approximation
• Coprime integers
• Diophantine equation

ALGEBRAIC STRUCTURE AND DEGREE REDUCTION Let S ⊂ Fn . We define deg(S) to be the minimal degree of a non-zero polynomial that vanishes on S. We have seen that for a finite set S, deg(S) ≤ n|S|1/n . In fact, we can sa

Source URL: math.mit.edu

• Mathematics
• Mathematical analysis
• Algebra
• Polynomials
• Transcendental numbers
• Diophantine approximation
• Coding theory
• Algebraic function
• Elliptic curve

DIOPHANTINE APPROXIMATION WITH ARITHMETIC FUNCTIONS, II EMRE ALKAN, KEVIN FORD AND ALEXANDRU ZAHARESCU Abstract. We prove that real numbers can be well-approximated by the normalized Fourier coefficients of newforms. 1.

Source URL: www.math.uiuc.edu

DIOPHANTINE APPROXIMATION WITH ARITHMETIC FUNCTIONS, I EMRE ALKAN, KEVIN FORD AND ALEXANDRU ZAHARESCU Abstract. We prove a strong simultaneous Diophantine approximation theorem for values of additive and multiplicative f

Source URL: www.math.uiuc.edu

AN ANALOGUE OF LIOUVILLE’S THEOREM AND AN APPLICATION TO CUBIC SURFACES DAVID MCKINNON AND MIKE ROTH Abstract. We prove a strong analogue of Liouville’s Theorem in Diophantine approximation for points on arbitrary al

Source URL: www.mast.queensu.ca